Strong Iterative Pairs and The Regularity of Context-Free Languages
نویسندگان
چکیده
منابع مشابه
Strong Topological Regularity and Weak Regularity of Banach Algebras
In this article we study two different generalizations of von Neumann regularity, namely strong topological regularity and weak regularity, in the Banach algebra context. We show that both are hereditary properties and under certain assumptions, weak regularity implies strong topological regularity. Then we consider strong topological regularity of certain concrete algebras. Moreover we obtain ...
متن کاملThe Impact of Mediational Artifact Types on EFL Learners’ Writing Complexity: Collaboration vs. Asynchronous Artifacts
The present study was an attempt to investigate the significance of environmental changes on the develo p- ment of writing in English as a Foreign Language (EFL) context with respect to the individual. This study also compared the impacts of collaboration and asynchronous computer mediation (ACM) on the writing complexity of EFL learners. To this end, three intact writing classes were designate...
متن کاملDeciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time
The hairpin completion is an operation on formal languages that has been inspired by the hairpin formation in DNA biochemistry and by DNA computing. In this paper we investigate the hairpin completion of regular languages. It is well known that hairpin completions of regular languages are linear context-free and not necessarily regular. As regularity of a (linear) context-free language is not d...
متن کاملLexical Semantics and Selection of TAM in Bantu Languages: A Case of Semantic Classification of Kiswahili Verbs
The existing literature on Bantu verbal semantics demonstrated that inherent semantic content of verbs pairs directly with the selection of tense, aspect and modality formatives in Bantu languages like Chasu, Lucazi, Lusamia, and Shiyeyi. Thus, the gist of this paper is the articulation of semantic classification of verbs in Kiswahili based on the selection of TAM types. This is because the sem...
متن کاملRegularity of non context-free languages over a singleton terminal alphabet
It is well-known that: (i) every context-free language over a singleton terminal alphabet is regular [4], and (ii) the class of languages that satisfy the Pumping Lemma is a proper super-class of the context-free languages. We show that any language in this super-class over a singleton terminal alphabet is regular. Our proof is based on a transformational approach and does not rely on Parikh’s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 19 شماره
صفحات -
تاریخ انتشار 1985